Search results

The purpose of this chapter is to optimize multi-criteria formulation for green vehicle routing problems by mixed integer programming. This research is about the road freight transportation of a Spanish company of groceries. This company has more power in the north of Spain and hence it was founded there. The data used for the computational experiments are focused in the northern region of Spain. The data have been used to decide the best route in order to obtain a minimization of costs for the company. The problem focused on the distance traveled and the altitude difference; by studying these parameters, the best solution of route transportation has been made. The software used to solve this model is CPLEX solver with AMPL programming language. This has been helpful to obtain the results for the research and some conclusions have been obtained from them.

The purpose of this chapter is to solve multi-objective formulation for traveling salesman and transportation problems. Computations are based on real data for the road freight transportation of a Spanish company. The company was selected because of its importance in Spanish economy and market. This company is important in the whole country; however, it has its higher importance in the northern part of Spain. The requirements for these models are the minimization of total distance and the CO₂ emissions. To achieve this, it is required to know and carry out the minimization of the total distance traveled by the trucks during the deliveries. The deliveries are going to be executed between the different locations, nodes, in the region, and Elorrio, where the depot is situated. The data have been used to decide the best route in order to obtain a minimization of cost for the company. As it was mentioned earlier, the problems are focused on the reduction of the amount of CO₂ emissions and minimization of total distance; by studying different parameters, the best solutions of route transportation have been obtained. The software used to solve these models is CPLEX solver with AMPL programming language.

For any given customer, his/her profitability for a business enterprise can be estimated by the so-called customer lifetime value (CLV). One specific goal for many enterprises consists in maximizing the aggregated CLV associated with its set of customers. To achieve this goal, a company uses marketing resources (e.g. marketing campaigns), which are usually expensive.

This paper proposes a formal model of the Customer Life Value problem inspired by the uncapacitated facility location problem.

The computational experiments conducted by the authors illustrate the potential of the approach when compared with a standard (non-algorithm-supported) one.

The approach leads up to the economic trade-off between the volume of the employed resources and the aggregated CLV, i.e. the higher the number of resources utilized, but also the higher the cost of achieving this level of lifetime value. Hence, the number of resources to be “activated” has to be decided, and the effect of each of these resources on each CLV will depend upon how “close” the resource is from the corresponding customer (i.e. how large will the impact of the active resource on the customer).